A Understanding Cardinality Estimation using Entropy Maximization

نویسندگان

  • CHRISTOPHER RÉ
  • DAN SUCIU
چکیده

Cardinality estimation is the process of estimating the number of tuples returned by a query. In relational database query optimization, cardinality estimates are key statistics used by the optimizer to choose an (expected) lowest cost plan. As a result of the importance of the problem, there are many sources of statistical information available to the optimizer, e.g., query feedback records [Stillger et al. 2001; Chaudhuri et al. 2008] and distinct value counts [Alon et al. 1996], and many models to capture some portion of the available statistical information, e.g., histograms [Poosala and Ioannidis 1997; Kaushik and Suciu 2009], samples [Haas et al. 1996], and sketches [Alon et al. 1999; Rusu and Dobra 2008]; but on any given cardinality estimation task, each method may return a different (and so, conflicting) estimate. Consider the following cardinality estimation task:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probability Density Estimation Using Entropy Maximization

We propose a method for estimating probability density functions and conditional density functions by training on data produced by such distributions. The algorithm employs new stochastic variables that amount to coding of the input, using a principle of entropy maximization. It is shown to be closely related to the maximum likelihood approach. The encoding step of the algorithm provides an est...

متن کامل

Coincidences and Estimation of Entropies of Random Variables with Large Cardinalities

We perform an asymptotic analysis of the NSB estimator of entropy of a discrete random variable. The analysis illuminates the dependence of the estimates on the number of coincidences in the sample and shows that the estimator has a well defined limit for a large cardinality of the studied variable. This allows estimation of entropy with no a priori assumptions about the cardinality. Software i...

متن کامل

Maximum Likelihood Estimation: A Single and Multi-objective Entropy Optimization Approach

In this paper we first considered a maximum likelihood estimation of trip distribution problem and next use primal-dual geometric programming method the said trip distribution problem converted into an entropy maximization trip distribution problem. Here the generalized cost function is assumed in different form, and then the said formulation is equivalent to single or multi-objective entropy m...

متن کامل

Conditional entropy maximization for PET

Maximum Likelihood (ML) estimation is extensively used for estimating emission densities from clumped and incomplete nzeasurement data in Positron Emission Tomography (PEU modality. Reconstruction produced by ML-algorithm has been found noisy because it does not make use of available prior knowledge. Bayesian estimation provides such a platform for the inclusion of prior knowledge in the recons...

متن کامل

A Fast Newton Algorithm for Entropy Maximization in Phase Determination

A long-standing issue in the Bayesian statistical approach to the phase problem in X-ray crystallography is to solve an entropy maxi-mization subproblem eeciently in every iteration of phase estimation. The entropy maximization problem is a semi-innnite convex program and can be solved in a nite dual space by using a standard Newton's method. However, the Newton's method is too expensive for th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011